A Formulation of Composition for Cellular Automata on Groups
نویسندگان
چکیده
منابع مشابه
Composition, Union and Division of Cellular Automata on Groups
We introduce the notion of 'Composition', 'Union' and 'Division' of cellular automata on groups. A kind of notions of compositions was investigated by Sato (1994) and Manzini (1998) for linear cellular automata, we extend the notion to general cellular automata on groups and investigated their properties. We observe the all unions and compositions generated by one-dimensional 2-neighborhood cel...
متن کاملA Cryptosystem Based on the Composition of Reversible Cellular Automata
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible ce...
متن کاملDynamics groups of asynchronous cellular automata
We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is π-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the local functions permute the periodic points, and these permutations generate the dynamics group. We have previously shown that exactly 104 of the possible 22 3...
متن کاملdeveloping a cellular automata model for urban growth
in the last decade, cellular automata models have been widely used for simulation spatial phenomena; however, exact nature of these models have been lead to various limitations for essential simulation of these phenomena. in this research, traditional cellular automata models have been developed through fuzzy theory, in which, transition rules are expressed based on fuzzy logic control methodol...
متن کاملReduction of behavior of additive cellular automata on groups
A class of additive cellular automata (ACA) on a finite group is defined by an index-group g and a finite field Fp for a prime modulus p [1]. This paper deals mainly with ACA on infinite commutative groups and direct products of them with some non commutative p-groups. It appears that for all abelian groups, the rules and initial states with finite supports define behaviors which being restrict...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2014
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e97.d.448